perm filename BLATTN.LE1[LET,JMC] blob sn#512970 filedate 1980-05-24 generic text, type C, neo UTF8
COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.require "let.pub" source
C00004 ENDMK
C⊗;
.require "let.pub" source
∂CSL Dr. Meera Blattner, Program Director↓Theoretical Computer Science
↓Directorate for Mathematical and Physical Sciences
↓National Science Foundation↓1800 G Street↓Washington, D.C. 20550∞
Dear Dr. Blattner:

	In so far as I understand it, what Gumb proposes to do
seems reasonable.  I have been using ordinary two-valued logic
recently, but there is certainly something left to be learned from 
studying the application of three-valued logics to computable
partial functions.  I don't know about free quantifiers, and
I am somewhat mystified by the reference to Boyer and Moore who
treat only provably total functions.

.sgn